#include <iostream>
#include <vector>
using namespace std;

class Solution1 {
public:
    int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
        int m = nums1.size(), n = nums2.size();

        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        for (int i = 1; i <= m; ++i)
        {
            for (int j = 1; j <= n; ++j)
            {
                if (nums1[i - 1] == nums2[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
                else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        return dp[m][n];
    }
};

class Solution2 {
public:
    int numDistinct(string s, string t) {
        int m = t.size(), n = s.size();

        vector<vector<double>> dp(m + 1, vector<double>(n + 1));

        for (int i = 0; i <= n; ++i) dp[0][i] = 1;

        for (int i = 1; i <= m; ++i)
        {
            for (int j = 1; j <= n; ++j)
            {
                dp[i][j] += dp[i][j - 1];
                if (t[i - 1] == s[j - 1]) dp[i][j] += dp[i - 1][j - 1];
            }
        }
        return dp[m][n];
    }
};

int main()
{
	return 0;
}